The reversible negacyclic codes over finite fields
نویسندگان
چکیده
In this paper, by investigating the factor of the x+1, we deduce that the structure of the reversible negacyclic code over the finite field Fq, where q is an odd prime power. Though studying q−cyclotomic cosets modulo 2n, we obtain the parameters of negacyclic BCH code of length n = q +1 2 , n = q−1 2(q−1) and n = q τ −1 2(qt+1) . Some optimal linear codes from negacyclic codes are given. Finally, we discuss a class of MDS LCD negacyclic codes.
منابع مشابه
Repeated-Root Self-Dual Negacyclic Codes over Finite Fields
Let Fq be a finite field with q = p , where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2p over Fq, a ≥ 1. The construction of self-dual negacyclic codes of length 2bp over Fq is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.
متن کاملSome Generalizations of Good Integers and Their Applications in the Study of Self-Dual Negacyclic Codes
Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of 2β-good integers, 2β-oddlygood integers, and 2β-evenly-good integers which are generalizations of good integers. Properties of such integers have been given as well as their ...
متن کاملOn MDS Negacyclic LCD Codes
This paper is devoted to the study of linear codes with complementary-duals (LCD) arising from negacyclic codes over finite fields Fq, where q is an odd prime power. We obtain two classes of MDS negacyclic LCD codes of length n| q−1 2 , n| q+1 2 and a class of negacyclic LCD codes of length n = q+1. Also, we drive some parameters of Hermitian negacyclic LCD codes over Fq2 of length n = q − 1 an...
متن کاملNew MDS Self-Dual Codes over Large Finite Fields
We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes. ∗Faculty of Mathematics USTHB, University of Sciences and Technology of Algiers, B.P 32 El Alia, Bab Ezzouar, Algiers, Algeria
متن کاملRepeated-root cyclic and negacyclic codes over a nite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.08206 شماره
صفحات -
تاریخ انتشار 2016